Determinization and Memoryless Winning Strategies
نویسندگان
چکیده
منابع مشابه
Games and Winning Strategies
'ILvo-person games are modeled as specifications in a language with angelic and demonic nondeterminism, and methods of program verification and transformation are used to reason about games. That a given strategy is winning can be proved using a variant of the traditional loop correctness rule. Furthermore, an implementation of the winning strategy can be derived using equivalence transformations.
متن کاملGames with additional winning strategies
In game theory, deciding whether a designed player wins a game corresponds to check whether he has a winning strategy. There are situations in which it is important to know whether some extra winning strategy also exists. In this paper we investigate this question over two-player finite games, under the reachability objective. We provide an automata-based technique that, given such a game, it a...
متن کاملAnalysis of Translation Strategies Employed in Awards-winning Subtitled Dramas
The increasing impact of audiovisual media and film industry in particular has led researchers to think of audiovisual translation strategies. Huge investments in film industry need global markets. Hence, there is a need for qualified translations and systematic studies dedicated to this area are in great demand. This study aims to investigate translation strategies adopted in the translation o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1997
ISSN: 0890-5401
DOI: 10.1006/inco.1997.2624